Equational methods in first order predicate calculus
نویسندگان
چکیده
منابع مشابه
First-order Regge Calculus
A rst order form of Regge calculus is de ned in the spirit of Palatini's action for general relativity. The extra independent variables are the interior dihedral angles of a simplex, with conjugate variables the areas of the triangles. There is a discussion of the extent to which these areas can be used to parameterise the space of edge lengths of a simplex. hep-th/9404124 Regge's equations of ...
متن کاملSystems of Illative Combinatory Logic Complete for First-Order Propositional and Predicate Calculus
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers systems of illative combinatory logic that are sound for first-order propositional and predicate calculus. The interpretation from ordinary logic into the illative systems can be done in two ways: ...
متن کاملCompleteness of two systems of illative combinatory logic for first-order propositional and predicate calculus
Illative combinatory logic consists of the theory of combinators or lambda calculus extended by extra constants (and corresponding axioms and rules) intended to capture inference. The paper considers 4 systems of illative combinatory logic that are sound for first-order propositional and predicate calculus.
متن کاملMeta-theory of first-order predicate logic
We present a formalization of parts of Melvin Fitting’s book “FirstOrder Logic and Automated Theorem Proving” [1]. The formalization covers the syntax of first-order logic, its semantics, the model existence theorem, a natural deduction proof calculus together with a proof of correctness and completeness, as well as the Löwenheim-Skolem theorem.
متن کاملEquational Prgoramming in lambda-calculus
A system of equations in the Acalculus is a pair (r, X) where I' is a set of formulas of A (the equations) and X is a finite set of variables of A (the unknowns). A system S = (r, X) is said to be solvable in the theory T (p'-solvable) iff there exists a simultaneous substitution with closed X-tem for the unknowns that makes the formulas of r theorems in the theory T. We define a class of syste...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1985
ISSN: 0747-7171
DOI: 10.1016/s0747-7171(85)80026-2